Pattern-based Subterm Selection in Isabelle
نویسندگان
چکیده
This article presents a pattern-based language designed to select (a set of) subterms of a given term in a concise and robust way. Building on this language, we implement a single-step rewriting tactic in the Isabelle theorem prover, which removes the need for obscure "occurrence numbers" for subterm selection. The language was inspired by the language of patterns of Gonthier and Tassi, but provides an elegant way of handling bound variables and a modular semantics.
منابع مشابه
Certified Subterm Criterion and Certified Usable Rules
In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in combination with usable rules. For both techniques we developed executable check functions using the theorem prover Isabelle/HOL. These functions are able to certify the correct application of the formalized techniques in a given ...
متن کاملAutomatic selection of the number of spatial filters for motor-imagery BCI
Common spatial pattern (CSP) is widely used for constructing spatial filters to extract features for motor-imagery-based BCI. One main parameter in CSP-based classification is the number of spatial filters used. An automatic method relying on Rayleigh quotient is presented to estimate its optimal value for each subject. Based on an existing dataset, we validate the contribution of the proposed ...
متن کاملEfficient Data Structures for Automated Theorem Proving in Expressive Higher-Order Logics
Church’s Simple Theory of Types (STT), also referred to as classical higher-order logic, is an elegant and expressive formal system built on top of the simply typed λ-calculus. Its mechanisms of explicit binding and quantification over arbitrary sets and functions allow the representation of complex mathematical concepts and formulae in a concise and unambiguous manner. Higher-order automated t...
متن کاملCompetitive baseline methods set new standards for the NIPS 2003 feature selection benchmark
We used the datasets of the NIPS 2003 challenge on feature selection as part of the practical work of an undergraduate course on feature extraction. The students were provided with a toolkit implemented in Matlab. Part of the course requirements was that they should outperform given baseline methods. The results were beyond expectations: the student matched or exceeded the performance of the be...
متن کاملHands-On Pattern Recognition
We organized a series of challenge for the conferences IJCNN/WCCI 2006, NIPS 2006 and IJCNN 2007 to explore various aspects of machine learning, ranging from the choice of data representation to the selection of the best model. The class of problems addressed are classification problems encountered in pattern recognition (classification of images, speech recognition), medical diagnosis, marketi...
متن کامل